Switching Perfect Control Algorithm
نویسندگان
چکیده
منابع مشابه
On Perfect Switching Classes
We study a graph transformation (defined by Seidel) called switching which, given a graph G = ( V,E) and a subset W C Jf of its vertices, builds a new graph by exchanging the cocycle linking W to V\ W with its complement. Switching is an equivalence relation and the associated equivalence classes are called switching classes. A switching class is perfect if it contains only perfect graphs. We s...
متن کاملA practical perfect hashing algorithm
Hashing is a fundamental technique in Computer Science, and perfect hashing, which guarantees constant-time lookup, has particular theoretical and practical importance. The algorithm of Fredman, Komll os, and Szemer edi 8], augmented by Dietzfelbinger, et al. 7], is a simple perfect hashing scheme that has not seen extensive use due to poor practical performance. In this paper, we develop modii...
متن کاملSWITCHING TEAMS ALGORITHM FOR SIZING OPTIMIZATION OF TRUSS STRUCTURES
Meta-heuristics have received increasing attention in recent years. The present article introduces a novel method in such a class that distinguishes a number of artificial search agents called players within two teams. At each iteration, the active player concerns some other players in both teams to construct its special movements and to get more score. At the end of some iterations (like quart...
متن کاملEnhancement of Robust Tracking Performance via Switching Supervisory Adaptive Control
When the process is highly uncertain, even linear minimum phase systems must sacrifice desirable feedback control benefits to avoid an excessive ‘cost of feedback’, while preserving the robust stability. In this paper, the problem of supervisory based switching Quantitative Feedback Theory (QFT) control is proposed for the control of highly uncertain plants. According to this strategy, the unce...
متن کاملSwitching control
We analyze the problem of switching controls for control systems endowed with different actuators. The goal is to control the dynamics of the system by switching from an actuator to another in a systematic way so that, at each instant of time, only one actuator is active. We first address a finite-dimensional model and show that, under suitable rank conditions, switching control strategies exis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry
سال: 2020
ISSN: 2073-8994
DOI: 10.3390/sym12050816